PEBBLING AND BANDWITHSUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 373-383; BIBL. 16 REF.Conference Paper

ON TAPE-BOUNDED COMPLEXITY CLASSES AND MULTIHEAD FINITE AUTOMATA.SUDBOROUGH IH.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 1; PP. 62-76; BIBL. 12 REF.Article

A NOTE ON WEAK OPERATOR PRECEDENCE GRAMMARS.SUDBOROUGH IH.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 213-218; BIBL. 9 REF.Article

THE COMPLEXITY OF PATH PROBLEMS IN GRAPHS AND PATH SYSTEMS OF BOUNDED BANDWIDTHSUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 293-305; BIBL. 18 REF.Conference Paper

SOME REMARKS ON MULTIHEAD AUTOMATA.SUDBOROUGH IH.1977; R.A.I.R.O. INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 3; PP. 181-195; BIBL. 1 P. 1/2Article

THE COMPLEXITY OF THE MEMBERSHIP PROBLEM FOR SOME EXTENSIONS OF CONTEXT-FREE LANGUAGES.SUDBOROUGH IH.1977; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 191-215; BIBL. 2 P.Article

ONE-WAY MULTIHEAD WRITING FINITE AUTOMATA.SUDBOROUGH IH.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 30; NO 1; PP. 1-20; BIBL. 18 REF.Article

A NOTE ON TAPE-BOUNDED COMPLEXITY CLASSES AND LINEAR CONTEXT-FREE LANGUAGES.SUDBOROUGH IH.1975; J. ASS. COMPUTG. MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 499-500; BIBL. 8 REF.Article

ON THE TAPE COMPLEXITY OF DETERMINISTIC CONTECT-FREE LANGUAGESSUDBOROUGH IH.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 3; PP. 405-414; BIBL. 28 REF.Article

A NOTE ON WEAK OPERATOR PRECEDENCE GRAMMARS.SUDBOROUGH IH.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 5; PP. 213-218; BIBL. 10 REF.Article

BOUNDED-REVERSAL MULTIHEAD FINITE AUTOMATA LANGUAGES.SUDBOROUGH IH.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 4; PP. 317-328; BIBL. 15 REF.Article

ON TAPE-BOUNDED COMPLEXITY CLASSES AND MULTI-HEAD FINITE AUTOMATA.SUDBOROUGH IH.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 138-144; BIBL. 12 REF.Conference Paper

TIME AND SPACE BOUNDED COMPLEXITY CLASSES AND BAND WIDTH CONSTRAINED PROBLEMS. (A SURVEY)MONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 78-93; BIBL. 27 REF.Conference Paper

BANDWITH CONSTRAINED NP-COMPLETE PROBLEMSMONIEN B; SUDBOROUGH IH.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 207-217; BIBL. 24 REF.Conference Paper

BOUNDING THE BANDWIDTH OF NP-COMPLETE PROBLEMSMONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 279-292; BIBL. 15 REF.Conference Paper

ON FAMILIES OF LANGUAGES DEFINED BY TIME-BOUNDED RANDOM ACCESS MACHINES.SUDBOROUGH IH; ZALCBERG A.1976; S.I.A.M.J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 2; PP. 217-230; BIBL. 4 REF.Article

ON ELIMINATING NONDETERMINISM FROM TURING MACHINES WHICH USE LESS THAN LOGARITHM WORKTAPE SPACEMONIEN B; SUDBOROUGH IH.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 3; PP. 237-253; BIBL. 14 REF.Article

ON ELIMINATING NONDETERMINISM FROM TURING MACHINES WHICH USE LESS THAN LOGARITHM WORKTAPE SPACEMONIEN B; SUDBOROUGH IH.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 430-445; BIBL. 9 REF.Conference Paper